0333 - 3590 Parallel knock - out schemes in networks
نویسندگان
چکیده
We consider parallel knock-out schemes, a procedure on graphs introduced by Lampert and Slater in 1997 in which each vertex eliminates exactly one of its neighbors in each round. We are considering cases in which after a finite number of rounds, where the minimimum number is called the parallel knock-out number, no vertices of the graph are left. We derive a number of combinatorial and algorithmical results on parallel knock-out numbers. We observe that for families of sparse graphs (like planar graphs, or graphs with bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices, which is basically tight for trees. Furthermore, we construct a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach, whereas the general problem is known to be NP-hard. Finally we show that claw-free graphs with minimum degree at least 2 have parallel knock-out number at most 2, and that the lower bound on the minimum degree is best possible.
منابع مشابه
REPORTS IN INFORMATICS ISSN 0333-3590 Binary Collusion-Secure Codes: Comparison and Improvements
With a digital fingerprinting scheme a vendor of digital copies of copyrighted material marks each individual copy with a unique fingerprint. If an illegal copy appears, it can be traced back to one or more guilty pirates, due to this fingerprint. To work against a coalition of several pirates the fingerprinting scheme must be based on a collusion-secure code. Quite a few collusion-secure codes...
متن کاملISSN 0333-3590 Iterative decoding for the asymmetric channel
We discuss several aspects of coding for the asymmetric channel, with emphasis on iterative coding. We implement turboand LDPC decoders for the Z-channel, and a novel coding scheme designed to approach the optimum input distribution for the channel. Index terms Z-channel, iterative decoding, channel capacity.
متن کاملREPORTS IN INFORMATICS ISSN 0333-3590 A Construction for Binary Sequence Sets with Low Peak-to-Average Power Ratio
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) with respect to any Local Unitary Unimodular Transform (including all one and multi-dimensional Discrete Fourier Transforms).
متن کامل0333 - 3590 Personal Information Leakage : A Study of Online Systems in Norway
Governments and commercial companies connect more and more computer systems to the Internet, giving people easier access to services. Many of these online services handle personal information. Leakage of such information can facilitate largescale identity theft. This report determines how personal information leaks from online systems of national importance, discusses proof of concept software ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004